On reductions of maximin machines

Scheduling and Tiling Reductions on Realistic Machines

Computations, where the number of results is much smaller than the input data and are produced through some sort of accumulation, are called Reductions. Reductions appear in many scientific applications. Usually, reductions admit an associative and commutative binary operator over accumulation. Reductions are therefore highly parallel. Given unbounded fan-in, one can execute a reduction in cons...

Maximin Correlation

This paper is concerned with the problem of finding a vector from a given set in a Euclidean space that maximizes the worst-case correlation with vectors in this set, where ‘worst’ means smallest. This problem, called the maximin correlation problem (MCP), comes up in several disciplines including pattern classification, portfolio selection, statistics, and signal processing. With a general inf...

On Truthful Mechanisms for Maximin Share Allocations

We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of n players, the maximin share of a single player is the best she can guarantee to herself, if she would partition the items in any way she prefers, into n bundles, and then receive her least desirable bundle. The objective then is to find an allocation, so that each player...

Maximin Separation Probability Clustering

This paper proposes a new approach for discriminative clustering. The intuition is, for a good clustering, one should be able to learn a classifier from the clustering labels with high generalization accuracy. Thus we define a novel metric to evaluate the quality of a clustering labeling, named Minimum Separation Probability (MSP), which is a lower bound of the generalization accuracy of a clas...

Über stochastische Maximin-Fixpunktgleichungen